Optimistic semaphores with non-deterministic choice operation for heterogeneous manycore systems
نویسندگان
چکیده
The Nix operating system permit different roles to be assigned to the cores. One of the roles is able to run userspace code with no interrupts from the operating system, which is particularly useful for HPC. System calls are especially expensive to a core playing this role. This paper presents a new implementation of optimistic semaphores that avoids performing expensive system calls in an uncontended scenario. The implementation is straightforward and somewhat unorthodox: a semaphore is based on a data structure and a lock that are shared between userspace and kernelspace. This study aims at evaluating if such an approach is viable. In addition, the implementation includes a non-deterministic choice operation over a collection of semaphores, altsems. This novel operation facilitates the creation of higher level communication mechanisms, such as sockets and channels. To support this claim, we implemented a new kind of buffered communication channels named tubes, tailored for communicating processes running on different (heterogeneous) cores. The paper describes the implementation of the semaphores and the tubes, a comparative analysis of optimistic and non-optimistic semaphores on Nix, and a comparative analysis of tubes and other kinds of communication channels that are available on the Nix operating system.
منابع مشابه
Hardware-Enabled Dynamic Resource Allocation for Manycore Systems Using Bidding-Based System Feedback
Manycore architectures are expected to dominate future general-purpose and application-specific computing systems. The everincreasing number of on-chip processor cores and the associated interconnect complexities present significant challenges in the design, optimization and operation of these systems. In this paper we investigate the applicability of intelligent, dynamic system-level optimizat...
متن کاملMonotonic Counters: A New Mechanism for Thread Synchronization
Only a handful of fundamental mechanisms for synchronizing the access of concurrent threads to shared memory are widely implemented and used. These include locks, condition variables, semaphores, barriers, and monitors. In this paper, we introduce a new synchronization mechanism—monotonic counters—and make a case for its addition to this group. Unlike most other synchronization mechanisms, mono...
متن کاملMulti-choice stochastic bi-level programming problem in cooperative nature via fuzzy programming approach
In this paper, a Multi-Choice Stochastic Bi-Level Programming Problem (MCSBLPP) is considered where all the parameters of constraints are followed by normal distribution. The cost coefficients of the objective functions are multi-choice types. At first, all the probabilistic constraints are transformed into deterministic constraints using stochastic programming approach. Further, a general tran...
متن کاملAn Efficient Solution to the Mutual Exclusion Problem Using Weak Semaphores
We present a simple solution to the mutual exclusion problem with no lockout that uses weak binary semaphores. Previously, Morris [4] presented a solution to this problem that uses three binary semaphores and two variable-size shared variables. A simpler solution was given in [5], where just two semaphores and two shared singlebit variables are used. (In some earlier versions, an incorrect one-...
متن کاملOptimal Operation of Microgrid in the presence of Real-time Pricing Demand Response Program using Artificial Bee Colony Algorithm with a Modified Choice Function
Abstract: Microgrid is one of the newest technologies in power systems. Microgrid can usually has a set of distributed energy resources that makes it able to operate separate from power grid. Optimal operation of microgrids means the optimal dispatch of power resources through day and night hours. This thesis proposed a new method for optimal operation of microgrid. In this method, real-time pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Concurrency and Computation: Practice and Experience
دوره 27 شماره
صفحات -
تاریخ انتشار 2015